A distributed concurrency control mechanism for XML data
نویسندگان
چکیده
منابع مشابه
XPath-based Concurrency Control for XML Data
For concurrency control of XML data, this paper proposes a new locking method based on XPath with a new data management model. Although increasing concurrency for XML data becomes an important issue in XML data management, few effective methods providing high concurrency of transactions working on the same XML document have been proposed so far. To overcome this problem, we propose a locking me...
متن کاملSXDGL: Snapshot Based Concurrency Control Protocol for XML Data
Nowadays, concurrency control for XML data is a big research problem. There are a number of researchers working on this problem, but most of the proposed methods are based on the two-phase locking protocol, which potentially leads to a high blocking rates in data-intensive XML-applications. In this paper we present and evaluate SXDGL, a new snapshot based concurrency control protocol for XML da...
متن کاملSXCCP+: Simple XML Concurrency Control Protocol for XML Database Systems
Increasing significance and popularity of XML is the main reason why many commercial object-relational database management systems (ORDBMS’s) developed XML storage and processing functionality. Additionally, there are new types of specialized database systems known as ’native’ XML database systems. As we know, concurrency control is one of the most important mechanisms in DBMS’s. Unfortunately,...
متن کاملA Framework for Distributed XML Data Management
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applications, the current solution consists of stacking several systems together. The juxtaposition of different computing models prevents reasoning on the application as a whole, and wastes important opportunities to improve...
متن کاملOptimistic Concurrency Control for Distributed Unsupervised Learning
Research on distributed machine learning algorithms has focused primarily on one of two extremes—algorithms that obey strict concurrency constraints or algorithms that obey few or no such constraints. We consider an intermediate alternative in which algorithms optimistically assume that conflicts are unlikely and if conflicts do arise a conflict-resolution protocol is invoked. We view this “opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2011
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2011.02.006